Fuzzy EDF Algorithm for Soft Real Time Systems
نویسندگان
چکیده
EDF is a classic dynamic embedded realtime multi-task scheduling algorithm. In an embedded soft real-time system, the deadline missing ratio is an important metric to evaluate system performance. When an embedded soft realtime system is overloaded, EDF algorithm is not effective. Considering the unsteadiness and unpredictability of a practical task running environment due to the unsteadiness of network communication and the time estimation deviation, it is necessary to introduce Fuzzy concept and theory to the scheduling field of embedded soft real-time application systems. In fuzzy scheduling model, all task‘s criticality and deadline distance are described with Fuzzy set. In our scheduling algorithm, a task’s scheduling priority is gotten by looking up the inference rule table with its Fuzzy deadline distance and Fuzzy criticality patterns. By comparing to traditional EDF algorithm to FUZZY EDF Algorithm FUZZY EDF Algorithm will have the less miss dead line ratio.
منابع مشابه
Adaptive Fuzzy Control on EDF Scheduling
EDF (Early Deadline First) algorithm is a very important scheduling algorithm for realtime systems . The EDF algorithm assigns priorities to each job according to their absolute deadlines and has good performance when the real-time system is not overloaded. When the real-time system is overloaded, many misdeadlines will be produced. But these misdeadlines are not uniformly distributed, which us...
متن کاملAn EDF-based Restricted-Migration Scheduling Algorithm for Multiprocessor Soft Real-Time Systems
There has been much recent interest in the use of the earliest-deadline-first (EDF) algorithm for scheduling soft real-time sporadic task systems on identical multiprocessors. In hard real-time systems, a significant disparity exists between EDF-based schemes and Pfair scheduling: on M processors, the worst-case schedulable utilization for all known EDF variants is approximately M/2, whereas it...
متن کاملSchedulability Test for Soft Real-Time Systems under Multiprocessor Environment by using an Earliest Deadline First Scheduling Algorithm
This paper deals with the study of Earliest Deadline First (EDF) which is an optimal scheduling algorithm for uniprocessor real time systems use for scheduling the periodic task in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists EDF-based schemes and RMA scheduling (which is the only known way of optimally scheduling recurrent real-time tasks on ...
متن کاملAn Efficient Non-Preemptive Algorithm for Soft Real-Time Systems using Domain Cluster-Group EDF
In this paper a new non-preemptive domain clustering scheduling algorithm for soft real time application is proposed. The main aim of this algorithm is to achieve high deadline meeting ratio of the group Earliest Deadline First (gEDF) algorithm by maintaining the excellent performance during normal load. An efficient non-preemptive algorithm called Domain Cluster – group EDF (DC-gEDF) is propos...
متن کاملModified MUF and EDF Algorithms for Overloaded Soft Real Time Systems
This paper proposes static and dynamic mechanisms by which MUF scheduling algorithm can be made more effective in overloaded soft real time systems (such as multimedia) using the concept of Random Dropping (RD) and negative laxity check. With introduction of RD, both algorithms result in higher values of DMTR as compared to without RD. Using negative laxity check and appropriate random dropping...
متن کامل